Eliminating false data dependences using the Omega test
نویسندگان
چکیده
منابع مشابه
Going Beyond Integer Programming with the Omega Test to Eliminate False Data Dependences
Array data dependence analysis methods currently in use generate false dependences that can prevent useful program transformations. These false dependences arise because the questions asked are conservative approximations to the questions we really should be asking. Unfortunately, the questions we really should be asking go beyond integer programming and require decision procedures for a subcla...
متن کاملVectorization Using Reversible Data Dependences
Data dependences between statements have long been used for detecting parallelism and converting sequential programs into parallel forms. However, some data dependences can be reversed and the transformed program still produces the same results. In this paper, we revisit vectorization and propose a new vectorization algorithm using reversible data dependences. The new algorithm can generate mor...
متن کاملUniqueness Analysis of Array Comprehensions Using the Omega Test Uniqueness Analysis of Array Comprehensions Using the Omega Test 1
In this paper we introduce the uniqueness problem of array comprehensions. An array comprehension has the uniqueness property if it de nes each array element at most once. Uniqueness is a necessary condition for the correctness of single assignment languages such as Haskell, Id, and Sisal. The uniqueness problem can be stated as a data dependence problem, which in itself can be reformulated as ...
متن کاملSheriff: Detecting and Eliminating False Sharing
False sharing is an insidious problem for multi-threaded programs running on multicore processors, where it can silently degrade performance and scalability. Debugging false sharing problems is notoriously difficult. Previous approaches aimed at identifying false sharing are not only prohibitively slow (degrading performance by 200X), but also cannot distinguish false sharing from true sharing,...
متن کاملTest of the Hypothesis That One Group of Dependences is Consistent with Another Group of Dependences
In this paper we describe the basic algorithmic characteristics of the test of the hypothesis that one group of dependences is consistent with another group of dependences for a case when the error disturbances of this data have normal distribution. Unpaired and paired versions are presented. The aim of our work was to find effective algorithms for biomarker identification in mass (MS) or Raman...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 1992
ISSN: 0362-1340,1558-1160
DOI: 10.1145/143103.143129